A ug 2 00 5 Mixed algorithms in the Ising model on directed Barabási - Albert networks
نویسنده
چکیده
On directed Barabási-Albert networks with two and seven neighbours selected by each added site, the Ising model does not seem to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation follows an Arrhenius law for Metropolis and Glauber algorithms, but for Wolff cluster flipping the magnetisation decays exponentially with time. On these networks the magnetisation behaviour of the Ising model, with Glauber, HeatBath, Metropolis, Wolf or Swendsen-Wang algorithm competing against Kawasaki dynamics , is studied by Monte Carlo simulations. We show that the model exhibits the phenomenon of self-organisation (= stationary equilibrium) defined in [8] when Kawasaki dynamics is not dominant in its competition with Glauber, HeatBath and Swendsen-Wang algorithms. Only for Wolff cluster flipping the magnetisa-tion, this phenomenon occurs after an exponentially decay of magnetisation with time. The Metropolis results are independent of competition. We also study the same process of competition described above but with Kawasaki dynamics at the same temperature as the other algorithms. The obtained results are similar for Wolff cluster flipping, Metropolis and Swendsen-Wang algorithms but different for HeatBath. Introduction Sumour and Shabat [1, 2] investigated Ising models on directed Barabási-Albert networks [3] with the usual Glauber dynamics. No spontaneous mag-netisation was found, in contrast to the case of undirected Barabási-Albert networks [4, 5, 6] where a spontaneous magnetisation was found below a critical temperature which increases logarithmically with system size. More recently, Lima and Stauffer [7] simulated directed square, cubic and hyper-cubic lattices in two to five dimensions with heat bath dynamics in order to separate the network effects form the effects of directedness. They also compared different spin flip algorithms, including cluster flips [9], for Ising-Barabási-Albert networks. They found a freezing-in of the magnetisation
منابع مشابه
2 4 M ay 2 00 5 Ising model simulation in directed lattices and networks
On directed lattices, with half as many neighbours as in the usual undirected lattices, the Ising model does not seem to show a spontaneous mag-netisation, at least for lower dimensions. Instead, the decay time for flipping of the magnetisation follows an Arrhenius law on the square and simple cubic lattice. On directed Barabási-Albert networks with two and seven neighbours selected by each add...
متن کامل6 Potts model with q states on directed Barabási - Albert networks
On directed Barabási-Albert networks with two and seven neighbours selected by each added site, the Ising model with spin S = 1/2 was seen not to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation followed an Arrhenius law for Metropolis and Glauber algorithms, but for Wolff cluster flipping the magnetisation decayed exponentially with time. However, on ...
متن کاملov 2 00 5 Majority - vote on directed Barabási - Albert networks
On directed Barabási-Albert networks with two and seven neighbours selected by each added site, the Ising model was seen not to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation followed an Arrhenius law for Metropolis and Glauber algorithms, but for Wolff cluster flipping the magnetisation decayed exponentially with time. On these networks the Majority...
متن کاملMajority-vote on Undirected Barabási-albert Networks
On Barabási-Albert networks with z neighbours selected by each added site, the Ising model was seen to show a spontaneous magnetisation. This spontaneous magnetisation was found below a critical temperature which increases logarithmically with system size. On these networks the majority-vote model with noise is now studied through Monte Carlo simulations. However, in this model, the order-disor...
متن کاملar X iv : 0 71 0 . 27 16 v 1 [ cs . N I ] 1 5 O ct 2 00 7 Cost and Effects of Pinning Control for Network Synchronization ∗
In this paper, the problem of pinning control for synchronization of complex dynamical networks is discussed. A cost function of the controlled network is defined by the feedback gain and the coupling strength of the network. An interesting result is that lower cost is achieved by the control scheme of pinning nodes with smaller degrees. Some rigorous mathematical analysis is presented for achi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005